Incremental network design with shortest paths
نویسندگان
چکیده
منابع مشابه
Incremental network design with shortest paths
We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, we show that the simplest variant is NP-hard, we analyze the worst-case performance of natural greedy heuristics, and we de...
متن کاملBounded Incremental Single-Source Shortest-Paths
We consider the problem of maintaining the distances of all vertices of a directed graph from a specific vertex, its source. We show algorithms in the bounded incremental computation (BIC) model which handle the insertion or deletion of an arc (or a batch of arcs outgoing from a shared vertex) in O(‖δ‖+ |δ| log |δ|) amortized time on Cyclic>0 graphs (i.e., graphs whose cycles have strictly posi...
متن کاملNetwork flows and shortest paths
Let G = (V,E) be a directed graph with two special vertices: a source s and a sink t. Every edge (u, v) has a capacity cap(u, v) ≥ 0. For convenience, we define cap(u, v) = 0 if (u, v) in not an edge. More specifically, we work with a modified set of edges {(u, v) : (u, v) ∈ E or (v, u) ∈ E} with cap(u, v) = 0 if (u, v) 6∈ E. A flow is a real-valued function on edges with three properties: • Sk...
متن کاملNetwork orientation via shortest paths
UNLABELLED The graph orientation problem calls for orienting the edges of a graph so as to maximize the number of pre-specified source-target vertex pairs that admit a directed path from the source to the target. Most algorithmic approaches to this problem share a common preprocessing step, in which the input graph is reduced to a tree by repeatedly contracting its cycles. Although this reducti...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.04.018